package com.liang.leetcode.binarytree.entity;

/**
 * 满叉树节点定义
 */
public class TreeNodeFull {
    public int val;
    public TreeNodeFull left;
    public TreeNodeFull right;
    public TreeNodeFull next;

    public TreeNodeFull() {
    }

    public TreeNodeFull(int val) {
        this.val = val;
    }

    public TreeNodeFull(int val, TreeNodeFull left, TreeNodeFull right, TreeNodeFull next) {
        this.val = val;
        this.left = left;
        this.right = right;
        this.next = next;
    }
}
